Iterative automatic global registration algorithm for multi-view point cloud of underground tunnel space
نویسندگان
چکیده
Aiming at the narrow and long tunnel structure, few internal features, a large amount of point cloud data, existing registration algorithms commercial software results are not ideal, an iterative global algorithm is proposed for massive underground registration, which composed local initial pose acquisition adjustment. Firstly, feature coordinates in extracted, then station-by-station performed according to Rodrigues matrix. Finally, result considered as value parameter, adjustment all observations carried out. The observation values weighted by selection weight iteration method weights constantly modified process until threshold conditions met stops. In this paper, experimental made up 85 stations from Xiamen subway tunnel, about 1300 m long. When accumulated error station-to-station too large, several regarded partial wholes, optimal achieved through multiple adjustments, accuracy within 5 mm. Experimental confirm feasibility effectiveness algorithm, provides new space tunnel.
منابع مشابه
Multi-view Point Cloud Registration Using Affine Shape Distributions
Registration is crucial for the reconstruction of multi-view single plane illumination microscopy. By using fluorescent beads as fiduciary markers, this registration problem can be reduced to the problem of point clouds registration. We present a novel method for registering point clouds across views. This is based on a new local geometric descriptor affine shape distribution to represent the r...
متن کامل2.5D Multi-View Gait Recognition Based on Point Cloud Registration
This paper presents a method for modeling a 2.5-dimensional (2.5D) human body and extracting the gait features for identifying the human subject. To achieve view-invariant gait recognition, a multi-view synthesizing method based on point cloud registration (MVSM) to generate multi-view training galleries is proposed. The concept of a density and curvature-based Color Gait Curvature Image is int...
متن کاملRobust iterative closest point algorithm based on global reference point for rotation invariant registration
The iterative closest point (ICP) algorithm is efficient and accurate for rigid registration but it needs the good initial parameters. It is easily failed when the rotation angle between two point sets is large. To deal with this problem, a new objective function is proposed by introducing a rotation invariant feature based on the Euclidean distance between each point and a global reference poi...
متن کاملAffine iterative closest point algorithm for point set registration
Article history: Received 24 April 2009 Received in revised form 15 January 2010 Available online 25 January 2010 Communicated by Y. Liu
متن کاملRigid Registration: The Iterative Closest Point Algorithm
This lecture continues the subject of point based rigid registration. An important aspect of the algorithms previously presented was the assumption that the pairing between point coordinates in the two coordinate systems is known. In this lecture we present an algorithm which will not require this assumption and furthermore does not require a full pairing between data sets. Problem Definition G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Measurement & Control
سال: 2021
ISSN: ['2051-8730', '0020-2940']
DOI: https://doi.org/10.1177/00202940211003935